Krein-Milman-type problems for compact matricially convex sets
نویسندگان
چکیده
منابع مشابه
Turán type reverse Markov inequalities for compact convex sets
For a compact convex set K ⊂ C the well-known general Markov inequality holds asserting that a polynomial p of degree n must have ∥∥p′∥∥ c(K)n2 ‖p‖. On the other hand for polynomials in general, ∥∥p′∥∥ can be arbitrarily small as compared to ‖p‖. The situation changes when we assume that the polynomials in question have all their zeroes in the convex set K. This was first investigated by Turán,...
متن کاملA cone theoretic Krein-Milman theorem in semitopological cones
In this paper, a Krein-Milman type theorem in $T_0$ semitopological cone is proved, in general. In fact, it is shown that in any locally convex $T_0$ semitopological cone, every convex compact saturated subset is the compact saturated convex hull of its extreme points, which improves the results of Larrecq.
متن کاملSpline Subdivision Schemes for Convex Compact Sets
The application of spline subdivision schemes to data consisting of convex compact sets with addition replaced by Minkowski sums of sets is investigated These methods generate in the limit set valued functions which can be expressed explicitly in terms of linear com binations of integer shifts of B splines with the initial data as coe cients The subdivision techniques are used to conclude that ...
متن کاملMoment Problems for Compact Sets
The solvability of the Hausdorff moment problem for an arbitrary compact subset of Euclidean n-space is shown to be equivalent to the nonnegativity of a family of quadratic forms derived from the given moment sequence and the given compact set. A variant theorem for the one-dimensional case and an analogous theorem for the trigonometric moment problem are also given. The one-dimensional theorem...
متن کاملClassifying compact convex sets with frames
Classification is a fundamental image processing task. Recent empirical evidence suggests that classification algorithms which make use of redundant linear transforms will regularly outperform their nonredundant counterparts. We provide a rigorous explanation of this phenomenon in the single-class case. We begin by developing a measure-theoretic analysis of the set of points at which a given de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1992
ISSN: 0024-3795
DOI: 10.1016/0024-3795(92)90383-l